@CodiumAI-Agent /describe
--pr_description.extra_instructions="
For the title, use the format [type]: [summary]
"

@CodiumAI-Agent /improve
--pr_code_suggestions.num_code_suggestions_per_chunk="4"

Title

feat: Added Weighted Interval Scheduling

User description

Describe your change:

• Add an algorithm?
• Documentation change?

Checklist:

• I have read CONTRIBUTING.md.
• This pull request is all my own work -- I have not plagiarized.
• I know that pull requests will not be merged if they fail the automated tests.
• This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
• All new Python files are placed inside an existing directory.
• All filenames are in all lowercase characters with no spaces or dashes.
• All functions and variable names follow Python naming conventions.
• All function parameters and return values are annotated with Python type hints.
• All functions have doctests that pass the automated testing.
• All new algorithms include at least one URL that points to Wikipedia or another similar explanation.

PR Type

Enhancement, Documentation

Description

• Implemented the Weighted Interval Scheduling algorithm to find the maximum weight subset of non-overlapping jobs.
• Added latest_non_conflict and find_max_weight functions with detailed docstrings and doctests.
• Updated DIRECTORY.md to include the new algorithm entry.

Changes walkthrough 📝

💡 PR-Agent usage: Comment /help "your question" on any pull request to receive relevant information

PR Code Suggestions ✨

Latest suggestions up to 129bba2

-for j in range(indx - 1, -1, -1):
-    if jobs[j][1] <= jobs[indx][0]:
-        return j
+low, high = 0, indx - 1
+while low <= high:
+    mid = (low + high) // 2
+    if jobs[mid][1] <= jobs[indx][0]:
+        if mid == indx - 1 or jobs[mid + 1][1] > jobs[indx][0]:
+            return mid
+        low = mid + 1
+    else:
+        high = mid - 1
 return -1

+if not jobs:
+    return 0
 jobs.sort(key=lambda ele: ele[1])

-jobs.sort(key=lambda ele: ele[1])
+try:
+    jobs.sort(key=lambda ele: ele[1])
+except IndexError:
+    raise ValueError("Each job must be a tuple of (start_time, end_time, weight)")

-dp = [0] * length
-dp[0] = jobs[0][2]
+dp = [jobs[0][2]] + [0] * (length - 1)

Previous suggestions

-for j in range(n - 1, -1, -1):
-    if jobs[j][1] <= jobs[n][0]:
-        return j
+low, high = 0, n - 1
+while low <= high:
+    mid = (low + high) // 2
+    if jobs[mid][1] <= jobs[n][0]:
+        if jobs[mid + 1][1] <= jobs[n][0]:
+            low = mid + 1
+        else:
+            return mid
+    else:
+        high = mid - 1
 return -1

+if not jobs:
+    return 0
 jobs.sort(key=lambda x: x[1])

 if len(jobs) == 0:
-    print("No jobs available to process")
-    raise SystemExit(0)
+    logger.error("No jobs available to process")
+    raise ValueError("No jobs available to process")

-dp = [0] * n
+max_weight_up_to_job = [0] * n

@tianyizheng02 can you please review this.